Non-regular estimation theory for piecewise continuous spectral densities
نویسندگان
چکیده
منابع مشابه
Energy Estimation for Piecewise Regular Processor Arrays
In this paper, we present a first approach for array-level energy estimation during high-level synthesis when mapping piecewise regular algorithms onto massively parallel full size processor arrays. Innately, piecewise regular algorithms have some power consumption friendly properties, e.g., they may be mapped onto processor arrays with only local interconnect and memory. In addition to these p...
متن کاملBehaviour of the spectral factorization for continuous spectral densities
Spectral factorization plays an important role in many applications such as Wiener filter design, prediction, and estimation. It is known that spectral factorization is a non-continuous mapping on the space of all non-negative continuous functions, satisfying the Paley-Wiener condition. Additionally, it will be shown in this paper that every continuous spectrum is a discontinuity point of the s...
متن کاملSpectral Factorization of Non-Rational Matrix-Valued Spectral Densities
Recently, a necessary and sufficient uniform log-integrability condition has been established for the canonical spectral factorization mapping to be sequentially continuous. Under this condition, if a sequence of spectral densities converge to a limiting spectral density then the canonical spectral factors of the sequence converges to the canonical spectral factor of the limiting density. Howev...
متن کاملDensities, spectral densities and modality
This paper considers the problem of specifying a simple approximating density function for a given data set (x1, . . . , xn). Simplicity is measured by the number of modes but several different definitions of approximation are introduced. The taut string method is used to control the numbers of modes and to produce candidate approximating densities. Refinements are introduced that improve the l...
متن کاملFast Estimation of Approximate Matrix Ranks Using Spectral Densities
Many machine learning and data-related applications require the knowledge of approximate ranks of large data matrices at hand. This letter presents two computationally inexpensive techniques to estimate the approximate ranks of such matrices. These techniques exploit approximate spectral densities, popular in physics, which are probability density distributions that measure the likelihood of fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2008
ISSN: 0304-4149
DOI: 10.1016/j.spa.2007.04.001